Optimal control problems with stopping constraints
نویسندگان
چکیده
منابع مشابه
On a Class of Optimal Stopping Problems with Mixed Constraints
The odds-strategy solves a certain class of sequential decision problems. Although, as we will show, the result needs only elementary tools, it is remarkable in several aspects. Indeed, the corresponding solution algorithm (odds-algorithm) has the property that it yields the optimal strategy and optimal value simultaneously, and that it is optimal itself, that is, no other solution algorithm ca...
متن کاملOptimal Control with Fuzzy Chance Constraints
In this paper, a model of an optimal control problem with chance constraints is introduced. The parametersof the constraints are fuzzy, random or fuzzy random variables. Todefuzzify the constraints, we consider possibility levels. Bychance-constrained programming the chance constraints are converted to crisp constraints which are neither fuzzy nor stochastic and then the resulting classical op...
متن کاملOptimal Control Problems with Mixed Constraints
We develop necessary conditions of broad applicability for optimal control problems in which the state and control are subject to mixed constraints. We unify, subsume and significantly extend most of the results on this subject, notably in the three special cases that comprise the bulk of the literature: calculus of variations, differential-algebraic systems, and mixed constraints specified by ...
متن کاملOptimal Stopping Problems
In the last lecture, we have analyzed the behavior of TD(λ) for approximating the costtogo function in autonomous systems. Recall that much of the analysis was based on the idea of sampling states according to their stationary distribution. This was done either explicitly, as was assumed in approximate value iteration, or implicitly through the simulation or observation of system trajectories...
متن کاملOptimal Control Problems with Mixed Control-State Constraints
Semilinear elliptic optimal control problems with pointwise control and mixed control-state constraints are considered. Necessary and sufficient optimality conditions are given. The equivalence of the SQP method and Newton’s method for a generalized equation is discussed. Local quadratic convergence of the SQP method is proved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2015
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-015-0286-3